An MPI Implementation of the SPAI Preconditioner on the T3E

نویسندگان

  • Stephen T. Barnard
  • Luis M. Bernardo
  • Horst D. Simon
چکیده

We describe and test spai_l.l, a parallel MPI implementation of the Sparse Approximate Inverse (SPAI) preconditioner. We show that SPAI can be very effective for solving a set of very large and difficult problems on a Cray T3E. The results clearly show the value of SPAI (and approximate inverse methods in general) as the viable alternative to ILU-type methods when facing very large and difficult problems. We strengthen this conclusion by showing that spai_1.1 also has very good scaling behavior.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallel Implementation of a Sparse Approximate Inverse Preconditioner

A parallel implementation of a sparse approximate inverse (spai) preconditioner for distributed memory parallel processors (dmpp) is presented. The fundamental spai algorithm is known to be a useful tool for improving the convergence of iterative solvers for ill-conditioned linear systems. The parallel implementation (parspai) exploits the inherent parallelism in the spai algorithm and the data...

متن کامل

A Block Version of the SPAI Preconditioner

We present a block version of the SPAI algorithm and test its performance on large nonsymmetric matrices in a parallel environment. The SPAI algorithm, initially proposed by Grote and Huckle 1], computes a SParse Approximate Inverse for use as a preconditioner for the iterative solution of a sparse linear system of equations. It has proved to be a robust and versatile preconditioner in numerous...

متن کامل

Parallel Performance of an MPI Solver for 3D Elasticity Problems

The numerical solution of 3D linear elasticity equations is considered. The problem is described by a coupled system of second order elliptic partial differential equations. This system is discretized by trilinear parallelepipedal finite elements. The Preconditioned Conjugate Gradient iterative method is used for solving of the large-scale linear algebraic systems arising after the Finite Eleme...

متن کامل

The performance and scalability of SHMEM and MPI-2 one-sided routines on a SGI Origin 2000 and a Cray T3E-600

This paper compares the performance and scalability of SHMEM and MPI-2 one-sided routines on different communication patterns for a SGI Origin 2000 and a Cray T3E-600. The communication tests were chosen to represent commonly used communication patterns with low contention (accessing distant messages, a circular right shift, a binary tree broadcast) to communication patterns with high contentio...

متن کامل

Modified Sparse Approximate Inverses (MSPAI) for Parallel Preconditioning

The solution of large sparse and ill-conditioned systems of linear equations is a central task in numerical linear algebra. Such systems arise from many applications like the discretization of partial differential equations or image restoration. Herefore, Gaussian elimination or other classical direct solvers can not be used since the dimension of the underlying coefficient matrices is too larg...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IJHPCA

دوره 13  شماره 

صفحات  -

تاریخ انتشار 1999